An E cient Competitive Strategy for Learning a

نویسندگان

  • Frank Ho
  • Klaus Kriegel
چکیده

We provide a competitive strategy for a mobile robot with vision, that has to explore an unknown simple polygon starting from and returning to a given point xo on the boundary. Our strategy creates a tour that does not exceed in length 133 times the length of the shortest watchman route from x0. It has been claimed before by other authors that a competitive strategy with factor 2016 exists for this problem; but no proof has appeared except for the easy rectilinear case.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-hierarchical Clustering with Rival Penalized Competitive Learning for Information Retrieval

In large content-based image database applications, e cient information retrieval depends heavily on good indexing structures of the extracted features. While indexing techniques for text retrieval are well understood, e cient and robust indexing methodology for image retrieval is still in its infancy. In this paper, we present a non-hierarchical clustering scheme for index generation using the...

متن کامل

Bidding Strategy on Demand Side Using Eligibility Traces Algorithm

Restructuring in the power industry is followed by splitting different parts and creating a competition between purchasing and selling sections. As a consequence, through an active participation in the energy market, the service provider companies and large consumers create a context for overcoming the problems resulted from lack of demand side participation in the market. The most prominent ch...

متن کامل

Understanding Kohonen Networks

Kohonen neural nets are some kind of competitive nets. The most commonly known variants are the Self-Organizing Maps (SOMs) and the Learning Vector Quantization (LVQ). The former model uses an unsupervized learning, the latter is an e cient classi er. This paper tries to give, in simple words, a clear idea about the basis of competitive neural nets and competitive learning emphasizing on the SO...

متن کامل

Elite Opposition-based Artificial Bee Colony Algorithm for Global Optimization

 Numerous problems in engineering and science can be converted into optimization problems. Artificial bee colony (ABC) algorithm is a newly developed stochastic optimization algorithm and has been widely used in many areas. However, due to the stochastic characteristics of its solution search equation, the traditional ABC algorithm often suffers from poor exploitation. Aiming at this weakness o...

متن کامل

HR Strategy and Its aligning with organizational strategy and human capabilities

With rapid changes in the business environment, organizations are increasingly looking at human resources as a unique asset that can provide sustained competitive advantage. As much as, people are viewed among the most important resources to firms, HR strategy would be central to achieve competitive advantages .Firms should view HR strategy as an important tool for integrating competencies insi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996